Evolutionary Algorithm with Roulette-Tournament Selection for Solving Aquaculture Diet Formulation

Roulette-tournament Selection for Shrimp Diet Formulation Problem

This paper aims to propose a new selection procedure for real value encoding problem, specifically for shrimp diet problem. This new selection is a hybrid between two well-known selection procedure; roulette wheel selection and binary tournament selection. Shrimp diet problem is investigated to understand the hard constraints and the soft constraints involved. The comparison between other exist...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

On Proportions of Fit Individuals in Population of Mutation-Based Evolutionary Algorithm with Tournament Selection.

In this article, we consider a fitness-level model of a non-elitist mutation-only evolutionary algorithm (EA) with tournament selection. The model provides upper and lower bounds for the expected proportion of the individuals with fitness above given thresholds. In the case of so-called monotone mutation, the obtained bounds imply that increasing the tournament size improves the EA performance....

The quasispecies regime for the simple genetic algorithm with roulette-wheel selection

We introduce a new parameter to discuss the behavior of a genetic algorithm. This parameter is the mean number of exact copies of the best fit chromosomes from one generation to the next. We argue that the genetic algorithm should operate efficiently when this parameter is slightly larger than 1. We consider the case of the simple genetic algorithm with the roulette–wheel selection mechanism. W...

An Evolutionary Algorithm for solving theS hool